Minimum H-decompositions of graphs

نویسندگان

  • Oleg Pikhurko
  • Teresa Sousa
چکیده

Given graphs G and H, an H-decomposition of G is a partition of the edge set of G such that each part is either a single edge or forms a graph isomorphic to H. Let φH(n) be the smallest number φ such that any graph G of order n admits an H-decomposition with at most φ parts. Here we determine the asymptotic of φH(n) for any fixed graph H as n tends to infinity. Partially supported by the National Science Foundation, Grant DMS-0457512. Research done while the author was visiting Carnegie Mellon University and partially supported by the Portuguese Science Foundation under grant SFRH/BD/8617/2002.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Minimum rainbow H-decompositions of graphs

Given graphs G and H, we consider the problem of decomposing a properly edge-colored graph G into few parts consisting of rainbow copies of H and single edges. We establish a close relation to the previously studied problem of minimum H-decompositions, where an edge coloring does not matter and one is merely interested in decomposing graphs into copies of H and single edges.

متن کامل

Chromatically Supremal Decompositions of Graphs

If G is a graph, a G-decomposition of a host graph H is a partition of the edges of H into subgraphs of H which are isomorphic to G. The chromatic index of a Gdecomposition of H is the minimum number of colors required to color the parts of the decomposition so that parts which share a common node get different colors. We establish an upper bound on the chromatic index and characterize those de...

متن کامل

H-Decompositions of r-graphs when H is an r-graph with exactly 2 edges

Given two r-graphs G and H, an H-decomposition of G is a partition of the edge set of G such that each part is either a single edge or forms a graph isomorphic to H. The minimum number of parts in an H-decomposition of G is denoted by φH(G). By a 2-edge-decomposition of an r-graph we mean an H-decomposition for any fixed r-graph H with exactly 2 edges. In the special case where the two edges of...

متن کامل

Minimum Weight H-Decompositions of Graphs: The Bipartite Case

Given graphs G and H and a positive number b, a weighted (H, b)-decomposition of G is a partition of the edge set of G such that each part is either a single edge or forms an H-subgraph. We assign a weight of b to each H-subgraph in the decomposition and a weight of 1 to single edges. The total weight of the decomposition is the sum of the weights of all elements in the decomposition. Let φ(n,H...

متن کامل

Chromatic Harmonic Indices and Chromatic Harmonic Polynomials of Certain Graphs

In the main this paper introduces the concept of chromatic harmonic polynomials denoted, $H^chi(G,x)$ and chromatic harmonic indices denoted, $H^chi(G)$ of a graph $G$. The new concept is then applied to finding explicit formula for the minimum (maximum) chromatic harmonic polynomials and the minimum (maximum) chromatic harmonic index of certain graphs. It is also applied to split graphs and ce...

متن کامل

Size-Constrained Tree Decompositions

Tree-Decompositions are the corner-stone of many dynamic programming algorithms for solving graph problems. Since the complexity of such algorithms generally depends exponentially on the width (size of the bags) of the decomposition, much work has been devoted to compute tree-decompositions with small width. However, practical algorithms computing tree-decompositions only exist for graphs with ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Comb. Theory, Ser. B

دوره 97  شماره 

صفحات  -

تاریخ انتشار 2007